n,t=map(int,input().split())
ans,b=0,1<<n
a=[[0]*11 for i in range(11)]
a[0][0]=t*(1<<n)
for i in range(n):
for j in range(i+1):
if a[i][j]>=b: a[i+1][j]+=(a[i][j]-b)//2; a[i+1][j+1]+=(a[i][j]-b)//2; ans+=1
print(ans)127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |
60. Permutation Sequence | 42. Trapping Rain Water |
32. Longest Valid Parentheses | Cutting a material |
Bubble Sort | Number of triangles |
AND path in a binary tree | Factorial equations |
Removal of vertices | Happy segments |
Cyclic shifts | Zoos |
Build a graph | Almost correct bracket sequence |
Count of integers | Differences of the permutations |
Doctor's Secret | Back to School |
I am Easy | Teddy and Tweety |
Partitioning binary strings | Special sets |
Smallest chosen word | Going to office |
Color the boxes | Missing numbers |